Max Fürbringer †

Random Max 2-sat and Max Cut

Given a 2-SAT formula F consisting of n variables and b n random clauses, what is the largest number of clauses maxF satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of 34 n and n. We prove that for < 1, the expected number of clauses satisfiable is b n o(1); for large , it is ( 34 + (p ))n; for = 1 + ", it is at least (1 + " O("3))n and at m...

Modelling Max-CSP as Partial Max-SAT

We define a number of original encodings that map MaxCSP instances into partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into SAT. Then, we report on an experimental investigation that was conducted to compare the performance profile of our encodings on random binary Max-CSP instances. Moreover, we define a new variant of the support encoding...

Max Wellington

Max Neuburger

On fuzzy-rough attribute selection: Criteria of Max-Dependency, Max-Relevance, Min-Redundancy, and Max-Significance

Attribute selection is one of the important problems encountered in pattern recognition, machine learning, data mining, and bioinformatics. It refers to the problem of selecting those input attributes or features that are most effective to predict the sample categories. In this regard, rough set theory has been shown to be successful for selecting relevant and nonredundant attributes from a giv...